Integer cells in convex sets
نویسندگان
چکیده
منابع مشابه
Integer cells in convex sets
Every convex body K in Rn admits a coordinate projection PK that contains at least vol( 1 6K) cells of the integer lattice PZ n, provided this volume is at least one. Our proof of this counterpart of Minkowski’s theorem is based on an extension of the combinatorial density theorem of Sauer, Shelah and Vapnik-Chervonenkis to Zn. This leads to a new approach to sections of convex bodies. In parti...
متن کاملInteger Optimization on Convex Semialgebraic Sets
Let Y be a convex set inRk defined by polynomial inequalities and equations of degree at most d ≥ 2 with integer coefficients of binary length at most l. We show that if the set of optimal solutions of the integer programming problem min{yk | y = (y1, . . . , yk) ∈ Y ∩Zk} is not empty, then the problem has an optimal solution y∗ ∈ Y ∩Zk of binary length ld O(k ). For fixed k, our bound implies ...
متن کاملUnbounded convex sets for non-convex mixed-integer quadratic programming
This paper introduces a fundamental family of unbounded convex sets that arises in the context of non-convex mixed-integer quadratic programming. It is shown that any mixed-integer quadratic program with linear constraints can be reduced to the minimisation of a linear function over a set in the family. Some fundamental properties of the convex sets are derived, along with connections to some o...
متن کاملMinimal infeasible constraint sets in convex integer programs
In this paper we investigate certain aspects of infeasibility in convex integer programs. In particular we are concerned with the problem of an upper bound for the minimal cardinality of the irreducible infeasible subset of constraints defining feasible region. We prove that for the considered class of convex functions, every infeasible system of inequality constraints in the convex integer pro...
متن کاملTest Sets for Integer Programs with Z-Convex Objective
In this paper we extend test set based augmentation methods for integer linear programs to programs with more general convex objective functions. We show existence and computability of finite test sets for these wider problem classes by providing an explicit relationship to Graver bases. One candidate where this new approach may turn out fruitful is the Quadratic Assignment Problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2005
ISSN: 0001-8708
DOI: 10.1016/j.aim.2004.10.005